public class Test {
    public static void main(String[] args) {
        BinaryTree myTree=new BinaryTree();
        BinaryTree.TreeNode root=myTree.createTree();
        System.out.println("前序遍历");
        myTree.preOrder(root);
        System.out.println("");
        System.out.println("中序遍历");
        myTree.inOrder(root);
        System.out.println("");
        System.out.println("后序遍历");
        myTree.postOrder(root);
        System.out.println("");
        myTree.size(root);
        System.out.println(myTree.nodeSize);
        System.out.println(myTree.size2(root));
        myTree.getLeafNodeCount1(root);
        System.out.println(myTree.leafSize);
        System.out.println(myTree.getLeafNodeCount2(root));
        System.out.println(myTree.getKLevelNodeCount(root,3));
        System.out.println(myTree.getHeight(root));
        System.out.println(myTree.find(root,'E').val);
        myTree.levelOrder(root);
        boolean isComplete=myTree.isCompleteTree(root);
        System.out.println(isComplete);
    }
}
